Detecting Key-Dependencies

نویسندگان

  • Tage Stabell-Kulø
  • Arne Helme
  • Gianluca Dini
چکیده

The confidentiality of encrypted data depends on how well the key under which it was encrypted is maintained. If a session key was exchanged encrypted under a long-term key, exposure of the longterm key may reveal the session key and hence the data encrypted with it. The problem of key-dependencies between keys can be mapped onto connectivity of a graph, and the resulting graph can be inspected. This article presents a structured method (an algorithm) with which keydependencies can be detected and analysed. Several well-known protocols are examined, and it is shown that they are vulnerable to certain attacks exploiting key-dependencies. Protocols which are free from this defect do exist. That is, when a session is terminated it is properly closed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Parameterized Complexity of Dependency Detection in Relational Databases

We study the parameterized complexity of classical problems that arise in the profiling of relational data. Namely, we characterize the complexity of detecting unique column combinations (candidate keys), functional dependencies, and inclusion dependencies with the solution size as parameter. While the discovery of uniques and functional dependencies, respectively, turns out to be W [2]-complet...

متن کامل

Special positions of body-and-cad frameworks

Geometric constraint systems underly popular Computer Aided Design software. Automated approaches for detecting dependencies in a design are critical for developing robust solvers and providing informative user feedback, and we provide algorithms for two types of dependencies. First, we give a pebble game algorithm for detecting generic dependencies. Then, we focus on identifying the “special p...

متن کامل

Automatically Integrating Life Science Data Sources

Data integration in the life sciences is currently implemented by very costly manually curated projects or by schemadriven approaches that require knowledge of the data sources and knowledge about schema integration techniques. We propose Aladin – an entirely different, almost automatic approach based on the database instances and domain knowledge on life science data sources. We focus on two m...

متن کامل

Detecting XML Functional Dependencies through Formal Concept Analysis

As XML becomes a popular data representation and exchange format over the web, XML schema design has become an important research area. Formal Concept Analysis (FCA) has been widely applied in many fields recently. In this paper, we propose the application of FCA to find functional dependencies (FDs) in XML databases. Our work is based on the definitions of the Generalized Tree Tuple, XML funct...

متن کامل

Variability is the spice of learning, and a crucial ingredient for detecting and generalizing in nonadjacent dependencies

An important aspect of language acquisition involves learning the syntactic nonadjacent dependencies that hold between words in sentences, such as subject/verb agreement or tense marking in English. Despite successes in statistical learning of adjacent dependencies, the evidence is not conclusive for learning nonadjacent items. We provide evidence that discovering nonadjacent dependencies is po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998